Visibility Graph of a Set of Line Sements: A Dynamic Sequential Algorithm and Its Parallel Version
نویسنده
چکیده
منابع مشابه
Epileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties
Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...
متن کاملA Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...
متن کاملParallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...
متن کاملA Parallel Algorithm for Determining the Congruence of Point Sets in Three-Dimensions
This paper describes an O(log 3 n) time O(n= logn) processors parallel algorithm for determining the congruence (exact matching) of two point sets in three-dimensions on a CREW PRAM, where n is the maximum size of the input point sets. Although optimal O(n logn) time sequential algorithms were developed for this problem, no e cient parallel algorithm was known previously. In the algorithm, the ...
متن کاملReconstruction of Parallel Line Segments From Endpoint Visibility Information
In general, visibility reconstruction problems involve determining a set of objects in the plane that exhibit a speci ed set of visibility constraints. In this paper, an algorithm for reconstructing a set of parallel line segments is presented, from speci ed visibility information contained in an extended endpoint visibility graph. The algorithm runs in polynomial time and relies on simple vect...
متن کامل